Generalized Power Domination in Regular Graphs
نویسندگان
چکیده
منابع مشابه
Generalized Power Domination in Regular Graphs
In this paper, we continue the study of power domination in graphs (see SIAM J. Discrete Math. 15 (2002), 519–529; SIAM J. Discrete Math. 22 (2008), 554–567; SIAM J. Discrete Math. 23 (2009), 1382–1399). Power domination in graphs was birthed from the problem of monitoring an electric power system by placing as few measurement devices in the system as possible. A set of vertices is defined to b...
متن کاملGeneralized power domination of graphs
In this paper, we introduce the concept of k-power domination which is a common generalization of domination and power domination. We extend several known results for power domination to k-power domination. Concerning the complexity of the k-power domination problem, we first show that deciding whether a graph admits a k-power dominating set of size at most t is NP-complete for chordal graphs a...
متن کاملOn Power Domination of Generalized Petersen Graphs
The power dominating problem is a variation of the classical domination problem in graphs. Electricity company use phase measurement units (PMUs) to produce the measuring data of a system, and use these data to estimate states of the system. Because of the high cost of PMUs, minimizing the number of PMUs on a system is an important problem for electricity companies. This problem can be modeled ...
متن کاملMinus domination in regular graphs
A three-valued function f defined on the vertices of a graph G = (V,E), f : V , ( 1 , 0 , 1), is a minus dominating function if the sum of its function values over any closed neighborhood is at least one. That is, for every v E V, f(N[v])>~ 1, where N[v] consists of v and every vertex adjacent to v. The weight of a minus dominating function is f ( V ) = ~ f (v) , over all vertices v E V. The mi...
متن کاملPower domination in cylinders, tori, and generalized Petersen graphs
A set S of vertices is defined to be a power dominating set (PDS) of a graph G if every vertex and every edge in G can be monitored by the set S according to a set of rules for power system monitoring. The minimum cardinality of a PDS of G is its power domination number. In this article, we find upper bounds for the power domination number of some families of Cartesian products of graphs: the c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Discrete Mathematics
سال: 2013
ISSN: 0895-4801,1095-7146
DOI: 10.1137/120891356